Network named fragments in a content centric network

ABSTRACT

A system facilitates efficient and secure transportation of content. An intermediate node receives a packet that corresponds to a fragment of a content object message that is fragmented into a plurality of fragments. One or more fragments of the plurality of fragments indicate a unique name that is a hierarchically structured variable-length identifier that comprises contiguous name components ordered from a most general level to a most specific level. The received fragment indicates an intermediate state which is based on a hash function performed on an intermediate state from a previous fragment and data included in the received fragment. In response to determining that the received fragment is a first fragment, the system identifies a first entry in a pending interest table for an interest with a name that is based on a hash of a content object and that corresponds to the first fragment.

CROSS-REFERENCE TO RELATED APPLICATION

This application is a continuation of U.S. application Ser. No. 14/851,894, filed Sep. 11, 2015, the entirety of which is incorporated herein by reference.

BACKGROUND Field

This disclosure is generally related to distribution of digital content. More specifically, this disclosure is related to a system and method for secure and efficient transportation of content in a content centric network based on a fragmentation protocol.

Related Art

The proliferation of the Internet and e-commerce continues to create a vast amount of digital content. Content centric network (CCN) architectures have been designed to facilitate accessing and processing such digital content. A CCN includes entities, or nodes, such as network clients, forwarders (e.g., routers), and content producers, which communicate with each other by sending interest packets for various content items and receiving content object packets in return. CCN interests and content objects are identified by their unique names, which are typically hierarchically structured variable length identifiers (HSVLI). An HSVLI can include contiguous name components ordered from a most general level to a most specific level. Generally, interests and content objects travel through a number of links before they can reach their destination. Each link can have its own maximum transmission unit (MTU), where the differing MTU limits impose different fragmentation requirements. End-to-end CCN fragmentation is described in U.S. Pat. App. Ser. Nos. 14/065,691 and 14/067,587, and cut-through forwarding of CCN message fragments with IP encapsulation is described in U.S. patent application Ser. No. 14/309,681.

Fragmentation protocols related to CCN continue to evolve. One secure fragmentation protocol for CCN is known as Fragmentation with Integrity Guarantees and Optional Authentication (FIGOA), described in Ghali et al., “Secure Fragmentation for Content-Centric Networks,” Computing Research Repository, 1405.2861 (2014), which disclosure is herein incorporated by reference in its entirety. The FIGOA protocol operates by creating fragments that are chained via hash computation, transmitting fragments with a name that match an interest for the name, and including a signature in the final fragment. However, under the FIGOA protocol, a content producer signs the final fragment, which creates a delayed verification of the signature by a requesting entity until all fragments have been received. This delayed verification may decrease the overall throughput of data and may also result in the injection of malicious packets, which can create inefficiencies and introduce security issues in the network. In addition, the FIGOA protocol does not provide a method to selectively request re-transmission of a specific fragment. When a fragment is dropped, the requesting entity re-requests the entire data stream, resulting in further inefficiencies in the network.

SUMMARY

One embodiment provides a system that facilitates efficient and secure transportation of content over a network. During operation, the system receives, by an intermediate node, a packet that corresponds to a fragment of a content object message that is fragmented into a plurality of fragments. One or more fragments of the plurality of fragments indicate a unique name. The received fragment indicates an intermediate state which is based on a hash function performed on an intermediate state from a previous fragment and data included in the received fragment. In response to determining that the received fragment is a first fragment, the system identifies a first entry in a pending interest table for an interest with a name that is based on a hash of a content object and that corresponds to the first fragment, and creates a second entry in the pending interest table based on a digest or a segment identifier for the content object message.

BRIEF DESCRIPTION OF THE FIGURES

FIG. 1 illustrates an exemplary network facilitating efficient and secure transportation of content over a network, in accordance with an embodiment of the present invention.

FIG. 2A illustrates an exemplary format for a first fragment of a content object message, in accordance with an embodiment of the present invention.

FIG. 2B illustrates an exemplary format for a subsequent fragment of a content object message, in accordance with an embodiment of the present invention.

FIG. 2C illustrates an exemplary format for a first fragment of a content object message, where the content object message is part of a live stream, in accordance with an embodiment of the present invention.

FIG. 2D illustrates an exemplary format for a subsequent fragment of a content object message, where the content object message is part of a live stream, in accordance with an embodiment of the present invention.

FIG. 2E illustrates an exemplary format for a final fragment of a content object message, where the content object message is part of a live stream, in accordance with an embodiment of the present invention.

FIG. 3A illustrates a fragmented content object, in accordance with an embodiment of the present invention.

FIG. 3B presents a table illustrating a chained hash calculation of the intermediate state corresponding to the fragments of the content object of FIG. 3A, in accordance with an embodiment of the present invention.

FIG. 4A presents a flow chart illustrating a method by a content producing device for fragmenting a content object message, in accordance with an embodiment of the present invention.

FIG. 4B presents a flow chart illustrating a method by a content producing device for fragmenting a content object message, in accordance with an embodiment of the present invention.

FIG. 5A presents a flow chart illustrating a method by a content producing device for fragmenting a content object message, where the data stream is a live stream, in accordance with an embodiment of the present invention.

FIG. 5B presents a flow chart illustrating a method by a content producing device for fragmenting a content object message, where the data stream is a live stream, in accordance with an embodiment of the present invention.

FIG. 6A presents a flow chart illustrating a method by an intermediate node for processing a fragment of a content object message, in accordance with an embodiment of the present invention.

FIG. 6B presents a flow chart illustrating a method by an intermediate node for processing a fragment of a content object message, in accordance with an embodiment of the present invention.

FIG. 6C presents a table illustrating an exemplary algorithm for processing a fragment of a content object message, in accordance with an embodiment of the present invention.

FIG. 6D presents a table illustrating an exemplary algorithm for processing a fragment of a content object message in a pending interest table, in accordance with an embodiment of the present invention.

FIG. 7 presents a flow chart illustrating a method by an intermediate node for processing a fragment of a content object message, where the data stream is a live stream, in accordance with an embodiment of the present invention.

FIG. 8 illustrates an exemplary apparatus that facilitates efficient and secure transportation of content over a network, in accordance with an embodiment of the present invention.

FIG. 9 illustrates an exemplary computer system that facilitates efficient and secure transportation of content over a network, in accordance with an embodiment of the present invention.

In the figures, like reference numerals refer to the same figure elements.

DETAILED DESCRIPTION

The following description is presented to enable any person skilled in the art to make and use the embodiments, and is provided in the context of a particular application and its requirements. Various modifications to the disclosed embodiments will be readily apparent to those skilled in the art, and the general principles defined herein may be applied to other embodiments and applications without departing from the spirit and scope of the present disclosure. Thus, the present invention is not limited to the embodiments shown, but is to be accorded the widest scope consistent with the principles and features disclosed herein.

Overview

Embodiments of the present invention provide a system which facilitates transportation of content over a content centric network based on a fragmentation protocol which uses efficient signature verification and allows for selective retransmission of individual fragments. One fragmentation scheme for transporting CCN content is known as Fragmentation with Integrity Guarantees and Optional Authentication (FIGOA). Under the FIGOA scheme, a content producer can fragment a content object and chain the fragments with a hash chain, where each fragment contains an intermediate state that is calculated based on the intermediate state from the previous fragment and the data from the respective fragment. Each fragment in FIGOA includes the full name of the content object message, while the signature of the producer is included only in the final fragment. The signature verification relies on the final state of the hash chain, which can only be computed when the final fragment is received. In addition, because the same name is included in each fragment, FIGOA does not provide a way to perform retransmission requests for a specific fragment or group of fragments.

Embodiments of the present invention address these inefficiencies by providing a fragmentation protocol also known as the Network Named Fragments (NNF) protocol that allows for more efficient signature verification and directly addressing individual CCN content object fragments. In the NNF protocol, the signature of the content producer is included in the first fragment, which makes the signature immediately verifiable. Subsequent fragments each contain an intermediate state which is based on a hash of the data of the respective fragment and the intermediate state from the previous fragment. Thus, the signature on the first fragment creates the root of a trusted hash chain for the remainder of the fragments.

In addition, the NNF protocol uniquely identifies each fragment based on certain state characteristics, such as overall digest, payload offset, and intermediate state (as described below in relation to FIGS. 2A-2B). These state characteristics can be encoded into the name of the fragment to allow selective retransmission of a specific fragment. The encoded name allows a content requestor (or an intermediate node), upon determining that a specific fragment of a stream has not been received, to selectively request the fragment by its unique name, thus obviating the need to re-request the entire stream.

The overall length of the fragmented content is not limited to a specific length, which allows for the transmission of large payloads. Content sent based on the NNF protocol can be very long content with a known digest (e.g., a video file), or can be segments where the digest is not known until the end of the segment (e.g., a live video stream). In the case of a segmented stream, a content producer sending data based on the NNF protocol can generate and include a same segment identifier in each segment. The producer signs the final fragment only after the overall digest is known (e.g., has been calculated based on the intermediate state of the previous hash chain), thus binding the segment identifier to the overall digest.

The following terms describe elements of a CCN architecture:

Content Object or “content object”: A single piece of named data, which is bound to a unique name. Content Objects are “persistent,” which means that a Content Object can move around within a computing device, or across different computing devices, but does not change. If any component of the Content Object changes, the entity that made the change creates a new Content Object that includes the updated content, and binds the new Content Object to a new unique name.

Unique Names: A name in a CCN is typically location independent and uniquely identifies a Content Object. A data-forwarding device can use the name or name prefix to forward a packet toward a network node that generates or stores the Content Object, regardless of a network address or physical location for the Content Object. In some embodiments, the name may be a hierarchically structured variable-length identifier (HSVLI). The HSVLI can be divided into several hierarchical components, which can be structured in various ways. For example, the individual name components parc, home, ccn, and test.txt can be structured in a left-oriented prefix-major fashion to form the name “/parc/home/ccn/test.txt.” Thus, the name “/parc/home/ccn” can be a “parent” or “prefix” of “/parc/home/ccn/test.txt.” Additional components can be used to distinguish between different versions of the content item, such as a collaborative document.

In some embodiments, the name can include a non-hierarchical identifier, such as a hash value that is derived from the Content Object's data (e.g., a checksum value) and/or from elements of the Content Object's name. A description of a hash-based name is described in U.S. patent application Ser. No. 13/847,814 (entitled “ORDERED-ELEMENT NAMING FOR NAME-BASED PACKET FORWARDING,” by inventor Ignacio Solis, filed 20 Mar. 2013), which is hereby incorporated by reference. A name can also be a flat label. Hereinafter, “name” is used to refer to any name for a piece of data in a name-data network, such as a hierarchical name or name prefix, a flat name, a fixed-length name, an arbitrary-length name, or a label (e.g., a Multiprotocol Label Switching (MPLS) label).

Interest or “interest”: A packet that indicates a request for a piece of data, and includes a name (or a name prefix) for the piece of data. A data consumer can disseminate a request or Interest across an information-centric network, which CCN routers can propagate toward a storage device (e.g., a cache server) or a data producer that can provide the requested data to satisfy the request or Interest.

The methods disclosed herein are not limited to CCN networks and are applicable to other architectures as well. A description of a CCN architecture is described in U.S. patent application Ser. No. 12/338,175 (entitled “CONTROLLING THE SPREAD OF INTERESTS AND CONTENT IN A CONTENT CENTRIC NETWORK,” by inventors Van L. Jacobson and Diana K. Smetters, filed 18 Dec. 2008), which is hereby incorporated by reference.

Exemplary Network and Communication

FIG. 1 illustrates an exemplary network 100 that facilitates efficient and secure transportation of content over a network, in accordance with an embodiment of the present invention. Network 100 can be a content centric network (CCN) and can include a client device 116, a content producing device 118, and a router or other forwarding device at nodes 102, 104, 106, 108, 110, 112, and 114. A CCN router can be a CCN forwarding device residing on top of an IP router. In other words, CCN can be implemented as an overlay on top of IP. Other CCN overlay architecture is also possible. A node can be a computer system, an end-point representing users, and/or a device that can generate interests or originate content.

A requesting entity (such as device 116) can generate an interest in a piece of content and send it to node 102. Intermediate nodes (such as CCN routers 102, 104, 112, and 114) can receive and forward the interest. A content producer (such as device or content producer 118) can satisfy the requested interest. Producer 118 can fragment a responsive content object 130 into x number of fragments, e.g., fragments 130.1-130.x. Producer 118 can sign the first fragment (as described below in relation to FIGS. 2A and 2B), and create a trusted hash chain of the remaining fragments (as described below in relation to FIGS. 3A and 3B). Producer 118 can immediately begin forwarding fragments 130.1-130.x, which fragments will travel the reverse path as the interest (e.g., to nodes 114, 112, 104, and 102) and reach device 116. Upon receiving the first fragment (e.g., fragment 130.1), device 116 can immediately verify the signature for the first fragment, which creates the root of the trusted hash chain for the remainder of the fragments. Device 116 can efficiently continue to receive the remainder of the trusted fragments without the delay incurred from a signature verification that can only occur when the final fragment has been received (as under the FIGOA protocol). Note that in CCN, intermediate nodes can, but are not required to, perform signature verification. Thus, the same efficiencies can be gained for signature verification performed by an intermediate node as for a requesting device. Device 116 can receive content object fragments 130.1-130.x and reassemble content object 130.

It is important to note the benefit for the consumer of signing the first fragment, when the overall digest and overall length are known ahead of time. If the last fragment is signed, instead, then a consumer must buffer all the prior fragments and wait for all the content to be received and the signature verified before using the data. Firewall systems checking signatures must likewise either buffer all fragments or pass them and only drop the last fragment if it fails verification. Because the first fragment is signed, the consumer can begin signature verification in parallel with receiving later fragments, as opposed to the last fragment begin signed where the signature verification time cannot be amortized over network time. One example can be seen in Guneysu et al., “Software Speed Records for Lattice-Based Signatures,” Post-Quantum Cryptography, Volume 7932:67-82, Lecture Notes in Computer Science (“Guneysu”). Guneysu finds that RSA 2048-bit signature verification takes 77,032 CPU cycles, elliptical curve takes 209,328 CPU cycles, and an optimized lattice signature verification takes 45,036 CPU cycles. Assuming a 3 GHz CPU, these times are 25.6 usec, 69.8 usec, and 15.0 usec, respectively. On a 10 Gbps link, a 1500 byte packet takes approximately 1.2 usec, so these delays are between 12.5 to 58 packet times.

Exemplary Format of CCN Content Object Message Fragments

FIG. 2A illustrates an exemplary format for a first fragment 210 of a content object message, in accordance with an embodiment of the present invention. First fragment 210 can include the following fields: a name 211 that can indicate the name of the content object and also contain encoded information to specifically identify the fragment; an overall digest 212 that is the digest of the entire fragmented payload for the CCN content object message; a payload offset 213 that is the byte offset where this fragment begins; an intermediate state 214 that is a value calculated based on the initialization vector and the payload or data associated with this fragment (e.g., data 216); an overall length 215 that is the total length of the entire fragmented payload; a data 216 that is the payload of this fragment and one of the input fields for the hash function to calculate intermediate state 214); and a signature 217 that is the signature of the producer of the content object message. First fragment 210 cannot be re-fragmented by an intermediate node, as described below in relation to FIG. 6A. Thus, first fragment 210 may contain no payload (e.g., no data 216) or a payload with a size smaller than a known MTU of the network.

FIG. 2B illustrates an exemplary format for a subsequent fragment 220 of a content object message, in accordance with an embodiment of the present invention. Subsequent fragment 220 can include similar fields as first fragment 210 of FIG. 2A. For example, subsequent fragment 220 can include the following fields: a name 221; an overall digest 222; a payload offset 223; an intermediate state 224; and a data 225. Name 221 can be optional in subsequent fragments when CCNx Nameless Objects are supported (as described in U.S. patent application Ser. No. 14/337,026). Under the NNF protocol, the name is included in the first fragment. Intermediate state 224 for subsequent fragment 220 is calculated based on a hash function performed on the intermediate state 214 of the previous fragment (e.g., intermediate state 214 of first fragment 210).

Overall digests 212 and 222 can be included in first fragment 210 and subsequent fragment 220, respectively, when the hash chain and the final overall digest is known in advance, e.g., when fragmenting a known file. The NNF protocol provides a slightly different format for the case of an unterminated data stream transmitted in segments of known length with a deferred digest computation, e.g., a live stream. FIG. 2C illustrates an exemplary format for a first fragment 230 of a content object message, where the content object message is part of a live stream, in accordance with an embodiment of the present invention. First fragment 230 can include similar fields as first fragment 210 of FIG. 2A. For example, first fragment 230 can include the following fields: a name 231; a payload offset 233; an intermediate state 234; and a data 236. First fragment 230 can also include a segment identifier 232 that is generated by a content producer and is included in all fragments of, e.g., a live data stream. In addition, first fragment 230 can include an overall length 235 that, as the total length of the stream is unknown, can include the length of the current segment. Unlike first fragment 210, first fragment 230 does not include a signature.

FIG. 2D illustrates an exemplary format for a subsequent fragment 240 of a content object message, where the content object message is part of a live stream, in accordance with an embodiment of the present invention. Subsequent fragment 240 can include similar fields as first fragment 230. For example, subsequent fragment can include a name 241, a segment identifier 242, a payload offset 243, an intermediate state 244, and a data 245. Subsequent fragment 240 does not include a signature or an overall length.

FIG. 2E illustrates an exemplary format for a final fragment 250 of a content object message, where the content object message is part of a live stream, in accordance with an embodiment of the present invention. Final fragment 250 can include similar fields as first fragment 230. For example, final fragment 250 can include a name 251, a segment identifier 252, a payload offset 253, an intermediate state 254, and a data 255. In addition to these fields, final fragment 250 can include an overall digest 256 that is calculated by the producer based on the hash chain of all of the fragmented data (as described below in relation to FIG. 5B). Final fragment 250 can also include a signature 257 of the producer of the content, where signature 257 binds the overall digest to the segment identifier for the content object message.

FIG. 3A illustrates a fragmented content object 300, in accordance with an embodiment of the present invention. Content object 300 includes a first fragment 310, which includes a name 311, an overall digest 312, a payload offset 313, an intermediate state 314 (“IS₀”), a data 315 (“DATA₀”), and a signature 316. Fragments 320, 330, 340, and 350 include similar fields as first fragment 310, but do not include a signature field.

FIG. 3B presents a table 360 illustrating a chained hash calculation of the intermediate state corresponding to fragments 310-350 of content object 300 of FIG. 3A, in accordance with an embodiment of the present invention. In first fragment 310, intermediate state 314 (ISo) is calculated based on a hash of an initialization vector and data 315 (DATA₀) of first fragment 310. In subsequent fragment 320, intermediate state 324 (IS_(i)) is calculated based on a hash of the intermediate state of the previous fragment (ISo of fragment 310) and data 325 (DATAi) of fragment 320. Each subsequent fragment includes an intermediate state that is calculated based on a hash of the intermediate state of the previous fragment and the data of that subsequent fragment. Finally, an overall digest 352 of fragment 350 is calculated based on a function of the intermediate state of the final fragment (IS₄ of fragment 350). The function can be a hash function or any other function which finalizes the output based on the input.

Selective Retransmission of a Fragment or Fragments

Because the NNF protocol uniquely identifies each fragment based on, e.g., {Name, OverallDigest, PayloadOffset, IntermediateState}, certain of these characteristics can be encoded into the name to uniquely address a fragment for selective retransmission. For example, Overall Digest (“OD”), Payload Offset (“PO”), and IntermediateState (“IS”) can be encoded in the name for a fragment:

/parc.com/movie.alto.mkv/OD=123abc/P0=4096/IS=653efa  (1)

By using this naming convention, a requesting entity or intermediate node can selectively request a specific fragment.

It is not required to name every fragment. A producer may, for example, name every 3rd fragment. If the MTU is 1500 bytes, then the retransmission window in this case would be 4500 bytes. When a consumer loses one or more fragments in such a block, it only needs to send an interest for the closest prior named fragment and it will receive a retransmission of all fragments in that named block.

Note that the first fragment has two names. There is the general name, e.g. “/parc/com/movie.alto.mkv”, which retrieves all fragments, and there is the fragment name, e.g. “/parc/com/movie.alto.mkv/OD=123abc/P0=0/IS=6a09e667 . . . ” where the IS in this case is the SHA-256 Initialization Vector. The fragment name would only retrieve the first fragment or first fragment block, not the entire set of fragments like the general name.

Similar to Name (1) above, a producer can name fragments of a segment with a Segment ID instead of an OverallDigest:

/parc/com/movie.alto.mkv/SID=444ddd/P0=4096/IS=135ace  (2)

An interest with a name similar to Name (2) enables retransmission of individual segment fragments or segment fragment blocks if not all fragments carry a name.

In addition, a requesting entity can selectively request a subset or chain of fragments by including the name and an additional payload size. For example, consider an interest with the following name:

/parc.com/movie.alto.mkv/OD=123abc/P0=4096/IS=653efa/PS=8192  (3)

If the size of each individual fragment is 1024B, an interest with Name (3) returns a chain of four fragments starting at byte offset 4096. Re-fragmentation can also occur. For example, consider an interest with the following name:

/parc.com/movie.alto.mkv/OD=123abc/P0=4096/IS=653efa/PS=7680  (4)

Similar to an interest with Name (3), an interest with name (4) returns a chain of four fragments. However, the fourth fragment of the chain is re-fragmented to 512B.

Fragmenting a Content Object of a Known Length

FIG. 4A presents a flow chart 400 illustrating a method by a content producing device for fragmenting a content object message, in accordance with an embodiment of the present invention. During operation, the system generates, by a content producing device or a content producer, a content object message that is responsive to an interest message (operation 402). The content producer fragments the content object message into a plurality of fragments, where one or more fragments indicate a unique name that is an HSVLI that comprises contiguous name components ordered from a most general level to a most specific level (operation 404). The content producer computes an intermediate state for a first fragment based on a hash function performed on an initialization vector for the content object message and the payload or data for the first fragment (operation 406). The content producer signs the first fragment by including a digital signature for the content producer in the first fragment (operation 408). The content producer computes an intermediate state for a subsequent fragment based on a hash function performed on the intermediate state from the previous fragment and the payload or data for the subsequent fragment (operation 410). The content producer determines whether the subsequent fragment is the final fragment (decision 412). If it is not, then the content producer repeats operation 410 on the next subsequent fragment. If it is the final fragment, then the operation continues as described by Label A in FIG. 4B.

FIG. 4B presents a flow chart 450 illustrating a method by a content producing device for fragmenting a content object message, in accordance with an embodiment of the present invention. During operation, the system calculates, by a content producing device or a content producer, the overall digest for the content object message based on the intermediate state for the final fragment (operation 452). The content producer includes the overall digest in the first fragment and all subsequent fragments (operation 454). The content producer then forwards all fragments by sending each fragment to the next-hop CCN node based on the reverse path of the interest message (described in operation 402 of FIG. 4A).

Fragmenting a Content Object of an Unknown Length

FIGS. 4A and 4B depict fragmentation under the NNF protocol when the digest is known in advance, e.g., for a file of a known length like a video file. In some embodiments, the digest is not known in advance, e.g., for a file of an unknown length like a live data stream. FIG. 5A presents a flow chart 500 illustrating a method by a content producing device for fragmenting a content object message, where the data stream is a live stream, in accordance with an embodiment of the present invention. During operation, the system generates, by a content producing device or a content producer, a content object message that is responsive to an interest message (operation 502). The content producer fragments the content object message into a plurality of fragments, where one or more fragments indicate a unique name that is an HSVLI that comprises contiguous name components ordered from a most general level to a most specific level (operation 504). The content producer computes an intermediate state for a first fragment based on a hash function performed on an initialization vector for the content object message and the payload or data for the first fragment (operation 506). The content producer generates a segment identifier for the content object message (operation 508), and includes the segment identifier in the first fragment (operation 510). The content producer forwards the first fragment by sending the first fragment to the next-hop CCN node based on the reverse path of the interest message (operation 512). The operation continues as described by Label B in FIG. 5B.

FIG. 5B presents a flow chart 550 illustrating a method by a content producing device for fragmenting a content object message, where the data stream is a live stream, in accordance with an embodiment of the present invention. During operation, the content producer computes an intermediate state for a subsequent fragment based on a hash function performed on an intermediate state from a previous fragment and a payload or data for the subsequent fragment (operation 552). The content producer includes the segment identifier in the subsequent fragment (operation 554). The content producer forwards the subsequent fragment by sending it to the next-hop CCN node based on the reverse path of the interest message (operation 556).

The content producer then determines whether the subsequent fragment is the final fragment (decision 558). If it is not, then the content producer repeats operations 552, 554, and 556 for the next subsequent fragment. If it is the final fragment, then the content producer calculates the overall digest for the content object message based on the intermediate state for the final fragment (operation 560), and includes the overall digest in the final fragment (operation 562). The content producer signs the final fragment by including a digital signature for the content producer in the final fragment, where the digital signature creates a relationship or a binding between the segment identifier and the overall digest (operation 564). The final fragment can be a tail object that contains no payload and can be transmitted after the processing delay of calculating the overall digest. Because the tail object is signed, the size of the tail object remains small to avoid re-fragmentation by an intermediate node.

The content producer then forwards the final fragment by sending it to the next-hop CCN node based on the reverse path of the interest message (operation 566). Note that while operation 512 is depicted as occurring before operations 556 and 566, the first fragment may not arrive before the other fragments (e.g., the subsequent and final fragments). A requesting entity such as a content consumer processes the first fragment as the root of the hash chain before trusting, processing, and reassembling the remaining fragments.

Processing a Fragment of a Content Object of a Known Length

FIG. 6A presents a flow chart 600 illustrating a method by an intermediate node for processing a fragment of a content object message, in accordance with an embodiment of the present invention. During operation, the system receives, by an intermediate node, an interest message with a name that is an HSVLI (operation 602). The interest may also include a content object hash restriction. For example, the name can be a hash-based name that includes the content object hash restriction. The intermediate node adds an entry in its pending interest table (PIT) for the interest message, including the name and, if included, the content object hash (operation 604). The intermediate node subsequently receives a packet that corresponds to a fragment of a content object message that is fragmented into a plurality of fragments (operation 606). One or more of the plurality of fragment indicate a unique name that is an HSVLI. The received fragment indicates an intermediate state which is based on a hash function performed on an intermediate state from a previous fragment and data included in the received fragment.

The intermediate node determines if the received fragment is the first fragment (decision 608). If the received fragment is the first fragment, the intermediate node identifies a corresponding entry in the PIT (“first entry”) based on the name or the content object hash for the first fragment (operation 610). The first fragment can be a signed content object that includes the name, the Keyld, the content object hash, the overall length, and the overall digest. The intermediate node creates a new entry in the PIT (“second entry”) based on the overall digest included in the first fragment, and removes the first entry from the PIT (operation 612). The second PIT entry can also include the overall length. Because the signature is included in the first fragment, the intermediate node can optionally perform a signature verification procedure (operation 614). The intermediate node can also verify the content by computing the hash of the initialization vector and the data from the first fragment, and comparing the result with the intermediate state included in the first fragment (not shown in FIG. 6A). The hash is computed over the first fragment, unlike in FIGOA where the content object hash of an interest matches the overall digest value, which can only be verified after all fragments are received. Thus, under the NNF protocol, the first fragment contains no payload or a payload of a small size such that an intermediate node will not re-fragment the first fragment.

If the received fragment is not the first fragment, the intermediate node identifies the corresponding entry in the PIT (e.g., the second entry) based on the name or the overall digest (operation 616). The intermediate node can verify the content by computing the hash of the intermediate state from the previous fragment and the data from the received fragment, and comparing the result with the intermediate state included in the received fragment (operation 618). The operation then continues as described by Label C in FIG. 6B.

FIG. 6B presents a flow chart 650 illustrating a method by an intermediate node for processing a fragment of a content object message, in accordance with an embodiment of the present invention. During operation, the intermediate node forwards the received fragment by sending it to the next-hop CCN node based on the faces listed in the identified PIT entry (e.g., the second entry) (operation 652). The intermediate node updates the total number of bytes forwarded based on a length and a position for the received fragment (operation 654). The intermediate node determines whether the total number of bytes forwarded is equal to the overall length for the content object message (as indicated in the second PIT entry) (operation 656). If it does not, the operation returns. If it does, the intermediate node clears the corresponding PIT entry (e.g., the second PIT entry) (operation 658).

Exemplary Algorithms for Processing a Fragment of a Content Object

FIG. 6C presents a table 670 illustrating an exemplary algorithm 1 for processing a fragment of a content object message, in accordance with an embodiment of the present invention. Note that the intermediate node is not required to cache any fragments, as the reassembly buffer “Buffer” only stores a chain of entries with {CurrentlS, NextlS, PayloadOffset, PayloadEnd}. The intermediate node stores the entries in order of PayloadOffset. The intermediate node creates an initial buffer entry with the SHA-256 initialization value and PayloadOffset of 0 and PayloadEnd of 0. All received fragments form a chain from the initial buffer entry. The next four rules are as per FIGOA: the first rule stores a singleton without predecessor or successor (steps 6-7); the second rule stores a fragment that continues a previous fragment (steps 8-9); the third rule stores a fragment that precedes a fragment (steps 10-11); and the fourth rule stores a fragment in between two existing fragments (steps 12-13). Upon storing and verifying a fragment, the intermediate node updates the “in-order” verified length to track the number of bytes verified in the hash chain. Upon verifying OverallLength bytes (indicating receipt of all fragments), the intermediate may verify the OverallDigest. If the current fragment is the fragment on which the intermediate node verified the OverallDigest, the intermediate node can locally mark this packet as the “last fragment” to indicate that the PIT may clear its state.

FIG. 6D presents a table 680 illustrating an exemplary algorithm 2 for processing a fragment of a content object message in a pending interest table, in accordance with an embodiment of the present invention. If the fragments are received in order, the first fragment has a name that matches an existing PIT entry. The intermediate node then creates a new PIT entry by OverallDigest and removes the PIT entry by name. Subsequent fragments output by Algorithm 1 will match on OverallDigest. However, if the fragments are not received in order, Algorithm 2 covers several conditions. If a PIT entry by OverallDigest exists, the intermediate node forwards along that PIT entry (steps 4-7). If the fragment has fragment state in the name, it may be a retransmission and can be matched against its own PIT entry by name (steps 8-12). If the previous lookup fails, the intermediate node creates the PIT entry by OverallDigest (steps 13-20). If a named fragment arrives before a chunk named fragment and the named fragment contains the fragment state in the name, the intermediate node strips the fragment state from the name and proceeds as for a chunk named fragment (steps 21-25).

Processing a Fragment of a Content Object of an Unknown Length

FIG. 7 presents a flow chart 700 illustrating a method by an intermediate node for processing a fragment of a content object message, where the data stream is a live stream, in accordance with an embodiment of the present invention. The first three operations (702, 704, and 706) of FIG. 7 are similar to operations 602, 604, and 606 of FIG. 6A. The main difference is that in step 706, the received fragment includes a segment identifier instead of the overall digest, and the signature is included in the final fragment instead of in the first fragment. Upon receiving the fragment, the intermediate node identifies a corresponding entry in the PIT (“second entry”) based on the name, the segment identifier, or the content object hash for the first fragment (operation 708). In some embodiments, if the received fragment is the first fragment, the intermediate node identifies a first entry in the PIT based on the name, creates the second entry based on the segment identifier, and removes the first entry from the PIT (not shown). The intermediate node verifies the content by computing the hash of the intermediate state from the previous fragment and the data from the received fragment, and comparing the result with the intermediate state included in the received fragment (operation 710). The intermediate node determines if the received fragment is a final fragment (decision 712). If the received fragment is not the final fragment, the operation continues as described by Label C in FIG. 6B. If the received fragment is the final fragment, because the signature is included in the final fragment and the intermediate node can optionally perform a signature verification procedure (operation 714) before continuing as described by Label C in FIG. 6B.

Exemplary Apparatus and Computer System

FIG. 8 illustrates an exemplary apparatus 800 that facilitates efficient and secure transportation of content over a network, in accordance with an embodiment of the present invention. Apparatus 800 can comprise a plurality of modules which may communicate with one another via a wired or wireless communication channel. Apparatus 800 may be realized using one or more integrated circuits, and may include fewer or more modules than those shown in FIG. 8. Further, apparatus 800 may be integrated in a computer system, or realized as a separate device which is capable of communicating with other computer systems and/or devices. Specifically, apparatus 800 can comprise a communication module 802, a pending interest table maintenance module 804, a content-fragmenting module 806, a state-calculating module 808, and a security module 810.

In some embodiments, communication module 802 can send and/or receive data packets to/from other network nodes across a computer network, such as a content centric network, where a data packet can correspond to a fragment of a content object message that is fragmented into a plurality of fragments. In response to determining that the received fragment is a first fragment, PIT maintenance module 804 can: identify a first entry in a PIT for an interest with a name that is based on a hash of a content object and that corresponds to the first fragment; create a second entry in the PIT based on a digest or a segment identifier for the content object message; and remove the first entry from the PIT. In response to determining that the received fragment is a subsequent fragment, PIT maintenance module 804 can identify an entry in the pending interest table for an interest with a digest or a segment identifier that corresponds to the subsequent fragment. In response to determining that the received fragment corresponds to an entry in the pending interest table, PIT maintenance module 804 can update the total number of bytes forwarded based on a length and a position for the received fragment. In response to determining that the total length of bytes forwarded is equal to the overall length, PIT maintenance module 804 can also remove the corresponding entry from the PIT.

Content-fragmenting module 806 can generate, by a content producing device, a content object message that is responsive to an interest message, and can fragment the content object message into a plurality of fragments. Content-fragmenting module 806 can also include in the first fragment no payload or a payload with a size smaller than a predetermined threshold that does not require re-fragmentation. State-calculating module 808 can compute an intermediate state for a first fragment based on a hash function performed on an initialization vector for the content object message. State-calculating module 808 can also compute an intermediate state for a subsequent fragment based on a hash function performed on an intermediate state from a previous fragment and a payload for the subsequent fragment.

Security module 810 can include in the first fragment a digital signature of the content producing device. Content-fragmenting module 806 can generate a segment identifier for the content object message, and can include the segment identifier in each fragment of the plurality of fragments. In response to determining that the content object message is completely generated, content-fragmenting module 806 can generate a final fragment. State-calculating module 808 can compute a digest for the complete content object message based on a hash function performed on the intermediate state from a previous fragment and a payload for the final fragment. Security module 810 can include in the final fragment a digital signature of the content producing device.

FIG. 9 illustrates an exemplary computer system that facilitates efficient and secure transportation of content over a network, in accordance with an embodiment of the present invention. Computer system 902 includes a processor 904, a memory 906, and a storage device 908. Memory 906 can include a volatile memory (e.g., RAM) that serves as a managed memory, and can be used to store one or more memory pools. Furthermore, computer system 902 can be coupled to a display device 910, a keyboard 912, and a pointing device 914. Storage device 908 can store an operating system 916, a content-processing system 918, and data 930.

Content-processing system 918 can include instructions, which when executed by computer system 902, can cause computer system 902 to perform methods and/or processes described in this disclosure. Specifically, content-processing system 918 may include instructions for sending and/or receiving data packets to/from other network nodes across a computer network, such as a content centric network (communication module 920). For example, content-processing system 918 can include instructions for receiving, by an intermediate node, a data packet that corresponds to a fragment of a content object message that is fragmented into a plurality of fragments (communication module 920).

Content-processing system 918 can include instructions for, in response to determining that the received fragment is a first fragment, identifying a first entry in a PIT for an interest with a name that is based on a hash of a content object and that corresponds to the first fragment (PIT maintenance module 922). Content-processing system 918 can also include instructions for creating a second entry in the PIT based on a digest or a segment identifier for the content object message, and removing the first entry from the PIT (PIT maintenance module 922). Content-processing system 918 can include instructions for, in response to determining that the received fragment is a subsequent fragment, identifying an entry in the pending interest table for an interest with a digest or a segment identifier that corresponds to the subsequent fragment (PIT maintenance module 922). Content-processing system 918 can also include instructions for, in response to determining that the received fragment corresponds to an entry in the pending interest table, updating the total number of bytes forwarded based on a length and a position for the received fragment. Content-processing system 918 can additionally include instructions for, in response to determining that the total length of bytes forwarded is equal to the overall length, removing the corresponding entry from the PIT (PIT maintenance module 922).

Content-processing system 918 can include instructions for generating a content object message that is responsive to an interest message, and can fragment the content object message into a plurality of fragments (content-fragmenting module 924). Content-processing system 918 can include instructions for including in the first fragment no payload or a payload with a size smaller than a predetermined threshold that does not require re-fragmentation (content-fragmenting module 924).

Content-processing system 918 can include instructions for computing an intermediate state for a first fragment based on a hash function performed on an initialization vector for the content object message, and for computing an intermediate state for a subsequent fragment based on a hash function performed on an intermediate state from a previous fragment and a payload for the subsequent fragment (state-calculating module 926).

Content-processing system 918 can also include instructions for including in the first fragment a digital signature of the content producing device (security module 928). Content-processing system 918 can include instructions for generating a segment identifier for the content object message, and for including the segment identifier in each fragment of the plurality of fragments (content-fragmenting module 924). Content-processing system 918 can include instructions for, in response to determining that the content object message is completely generated, generating a final fragment (content-fragmenting module 924). Content-processing system 918 can include instructions for computing a digest for the complete content object message based on a hash function performed on the intermediate state from a previous fragment and a payload for the final fragment (state-calculating module 926), and for including in the final fragment a digital signature of the content producing device (security module 928).

Data 930 can include any data that is required as input or that is generated as output by the methods and/or processes described in this disclosure. Specifically, data 930 can store at least: a packet that corresponds to a fragment of a content object message that is fragmented into a plurality of fragments; a unique name that is an HSVLI that comprises contiguous name components ordered from a most general level to a most specific level; a name that is based on a hash of a content object or that indicates a digest; an intermediate state for a fragment which is based on a hash function performed on an intermediate state from a previous fragment and data included in the fragment; a pending interest table; a digest for a content object; a segment identifier; a byte offset that corresponds to a starting byte for a fragment; an overall length for a content object; a payload size; an entry in a pending interest table; a digital signature of a content producing device; a total number of bytes forwarded; and a name that indicates the intermediate state, the byte offset, and the digest.

The data structures and code described in this detailed description are typically stored on a computer-readable storage medium, which may be any device or medium that can store code and/or data for use by a computer system. The computer-readable storage medium includes, but is not limited to, volatile memory, non-volatile memory, magnetic and optical storage devices such as disk drives, magnetic tape, CDs (compact discs), DVDs (digital versatile discs or digital video discs), or other media capable of storing computer-readable media now known or later developed.

The methods and processes described in the detailed description section can be embodied as code and/or data, which can be stored in a computer-readable storage medium as described above. When a computer system reads and executes the code and/or data stored on the computer-readable storage medium, the computer system performs the methods and processes embodied as data structures and code and stored within the computer-readable storage medium.

Furthermore, the methods and processes described above can be included in hardware modules. For example, the hardware modules can include, but are not limited to, application-specific integrated circuit (ASIC) chips, field-programmable gate arrays (FPGAs), and other programmable-logic devices now known or later developed. When the hardware modules are activated, the hardware modules perform the methods and processes included within the hardware modules.

In summary, in one aspect, a system is provided, comprising: a processor; and a storage device storing instructions that, when executed by the processor, cause the processor to perform a method, the method comprising: receiving, by an intermediate node, a packet that corresponds to a fragment of a content object message that is fragmented into a plurality of fragments, wherein one or more fragments of the plurality of fragments indicate a unique name, wherein the received fragment indicates an intermediate state which is based on a hash function performed on an intermediate state form a previous fragment and data included in the received fragment; and in response to determining that the received fragment is a first fragment: identifying a first entry in a pending interest table for an interest with a name that is based on a hash of a content object and that corresponds to the first fragment; and creating a second entry in the pending interest table based on a digest or a segment identifier for the content object message.

In another aspect, a computer-implemented method for forwarding packets is provided, comprising: receiving, by an intermediate node, a packet that corresponds to a fragment of a content object message that is fragmented into a plurality of fragments, wherein one or more fragments of the plurality of fragments indicates a unique name, wherein the received fragment indicates an intermediate state which is based on a hash function performed on an intermediate state from a previous fragment and data included in the received fragment; and in response to determining that the received fragment is a first fragment: identifying a first entry in a pending interest table for an interest with a name that is based on a hash of a content object and that corresponds to the first fragment; and creating a second entry in the pending interest table based on a digest or a segment identifier for the content object message.

In yet another aspect, non-transitory computer readable media encoded with instructions are provided. The instructions, when executed by a processor, cause the processor to perform a method of: receiving, by an intermediate node, a packet that corresponds to a fragment of a content object message that is fragmented into a plurality of fragments, wherein one or more fragments of the plurality of fragments indicate a unique name, wherein the received fragment indicates an intermediate state which is based on a hash function performed on an intermediate state form a previous fragment and data included in the received fragment; and in response to determining that the received fragment is a first fragment: identifying a first entry in a pending interest table for an interest with a name that is based on a hash of a content object and that corresponds to the first fragment; and creating a second entry in the pending interest table based on a digest or a segment identifier for the content object message.

The foregoing descriptions of embodiments of the present invention have been presented for purposes of illustration and description only. They are not intended to be exhaustive or to limit the present invention to the forms disclosed. Accordingly, many modifications and variations will be apparent to practitioners skilled in the art. Additionally, the above disclosure is not intended to limit the present invention. The scope of the present invention is defined by the appended claims. 

What is claimed is:
 1. A computer system for facilitating forwarding of packets, the system comprising: a processor; and a storage device storing instructions that, when executed by the processor, cause the processor to perform a method, the method comprising: receiving, by an intermediate node, a packet that corresponds to a fragment of a content object message that is fragmented into a plurality of fragments, wherein one or more fragments of the plurality of fragments indicate a unique name, wherein the received fragment indicates an intermediate state which is based on a hash function performed on an intermediate state form a previous fragment and data included in the received fragment; and in response to determining that the received fragment is a first fragment: identifying a first entry in a pending interest table for an interest with a name that is based on a hash of a content object and that corresponds to the first fragment; and creating a second entry in the pending interest table based on a digest or a segment identifier for the content object message.
 2. The computer system of claim 1, wherein a name for the received fragment indicates the intermediate state and a number indicating a byte offset that corresponds to a starting byte for the received fragment.
 3. The computer system of claim 1, wherein a name for the received fragment indicates a digest or a segment identifier for the content object message.
 4. The computer system of claim 1, wherein the first fragment indicates a digital signature of a producer of the content object message.
 5. The computer system of claim 1, wherein the first fragment includes no payload or a payload with a size smaller than a predetermined threshold that does not require re-fragmentation.
 6. The computer system of claim 1, wherein the received fragment indicates a segment identifier that is indicated in the other fragments of the content object message and identifies the fragment and the other fragments as corresponding to the content object message.
 7. The computer system of claim 6, wherein the received fragment is a final fragment of the content object message and includes a digital signature of a producer of the content object message, wherein the digital signature creates a relationship between the segment identifier and a digest for the content object message.
 8. The computer system of claim 1, wherein the method further comprises: in response to determining that the received fragment is the first fragment, removing the first entry from the pending interest table; and in response to determining that the received fragment is a subsequent fragment, identifying an entry in the pending interest table for an interest with a digest or a segment identifier that corresponds to the subsequent fragment.
 9. The computer system of claim 1 wherein the first fragment includes an overall length for the content object message, wherein a corresponding entry in the pending interest table includes the overall length and a total number of bytes forwarded, and wherein the method further comprises: in response to determining that the received fragment corresponds to an entry in the pending interest table, updating the total number of bytes forwarded based on a length and a position for the received fragment; and in response to determining that the total length of bytes forwarded is equal to the overall length, removing the corresponding entry from the pending interest table.
 10. A computer-implemented method for forwarding packets, the method comprising: receiving, by an intermediate node, a packet that corresponds to a fragment of a content object message that is fragmented into a plurality of fragments, wherein one or more fragments of the plurality of fragments indicates a unique name, wherein the received fragment indicates an intermediate state which is based on a hash function performed on an intermediate state from a previous fragment and data included in the received fragment; and in response to determining that the received fragment is a first fragment: identifying a first entry in a pending interest table for an interest with a name that is based on a hash of a content object and that corresponds to the first fragment; and creating a second entry in the pending interest table based on a digest or a segment identifier for the content object message.
 11. The method of claim 10, wherein a name for the received fragment indicates the intermedia state and a number indicating a byte offset that corresponds to a starting byte for the received fragment.
 12. The method of claim 10, wherein a name for the received fragment indicates a digest or a segment identifier for the content object message.
 13. The method of claim 10, wherein the first fragment indicates a digital signature of a producer of the content object message.
 14. The method of claim 10, further comprising: in response to determining that the received fragment is the first fragment: removing the first entry from the pending interest table; and in response to determining that the received fragment is a subsequent fragment, identifying an entry in the pending interest table for an interest with a digest or a segment identifier that corresponds to the subsequent fragment.
 15. The method of claim 10, wherein the first fragment includes an overall length for the content object message, and wherein a corresponding entry in the pending interest table includes the overall length and a total number of bytes forwarded, the method further comprising: in response to determining that the received fragment corresponds to an entry in the pending interest table, updating the total number of bytes forwarded based on a length and a position for the received fragment; and in response to determining that the total length of bytes forwarded is equal to the overall length, removing the corresponding entry from the pending interest table.
 16. Non-transitory computer readable media encoded with instructions that, when executed by a processor, cause the processor to perform the method of: receiving, by an intermediate node, a packet that corresponds to a fragment of a content object message that is fragmented into a plurality of fragments, wherein one or more fragments of the plurality of fragments indicate a unique name, wherein the received fragment indicates an intermediate state which is based on a hash function performed on an intermediate state form a previous fragment and data included in the received fragment; and in response to determining that the received fragment is a first fragment: identifying a first entry in a pending interest table for an interest with a name that is based on a hash of a content object and that corresponds to the first fragment; and creating a second entry in the pending interest table based on a digest or a segment identifier for the content object message.
 17. The non-transitory computer readable media of claim 16, wherein a name for the received fragment indicates the intermediate state and a number indicating a byte offset that corresponds to a starting byte for the received fragment.
 18. The non-transitory computer readable media of claim 16, wherein a name for the received fragment indicates a digest or a segment identifier for the content object message.
 19. The non-transitory computer readable media of claim 16, further comprising instructions to cause the processor to perform: in response to determining that the received fragment is the first fragment, removing the first entry from the pending interest table; and in response to determining that the received fragment is a subsequent fragment, identifying an entry in the pending interest table for an interest with a digest or a segment identifier that corresponds to the subsequent fragment.
 20. The non-transitory computer readable media of claim 16, wherein the first fragment includes an overall length for the content object message, wherein a corresponding entry in the pending interest table includes the overall length and a total number of bytes forwarded, and further comprising instructions to cause the processor to perform: in response to determining that the received fragment corresponds to an entry in the pending interest table, updating the total number of bytes forwarded based on a length and a position for the received fragment; and in response to determining that the total length of bytes forwarded is equal to the overall length, removing the corresponding entry from the pending interest table. 